Unified Error Probability Analysis for Error Correcting Codes with Different Decoding Algorithms
نویسندگان
چکیده
The error rate of error correcting codes with soft-decision-decoding rarely has a closed-form expression. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for a low signal-to-noise ratios region and become looser when a suboptimum decoding algorithm is used. The radius of decision region is applied to evaluate the word error rate (WER) of error correcting codes with different decoding algorithms. Simulation results show that this method can effectively evaluate the WER of different decoders with 0.05dB maximum error.
منابع مشابه
A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting
We propose a parallel decoding algorithm based on error checking and correcting to improve the performance of the short polar codes. In order to enhance the error-correcting capacity of the decoding algorithm, we first derive the error-checking equations generated on the basis of the frozen nodes, and then we introduce the method to check the errors in the input nodes of the decoder by the solu...
متن کاملPerformance Analysis of Forward Error Correction Codes used for Transmission of data considering Failures in Coder/Decoder Circuits
Reliable and efficient transmission of data over a wireless network has been an increasing demand for the past few years. Whereas, major concern is the control of errors and to obtain reliable reproduction of data .This is achieved by using a variety of error control codes which improves BER performance in digital communication systems and are important in wireless information networks. Perform...
متن کاملIdeal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
Over the past five years a number of algorithms decoding some well-studied error-correcting codes far beyond their “error-correcting radii” have been developed. These algorithms, usually termed as listdecoding algorithms, originated with a list-decoder for Reed-Solomon codes [36, 17], and were soon extended to decoders for Algebraic Geometry codes [33, 17] and as also some number-theoretic code...
متن کاملIeee Signal Processing Magazine
and artificial intelligence may be viewed as instances of the summary-product algorithm (or belief/probability propagation algorithm), which operates by message passing in a graphical model. Specific instances of such algorithms include Kalman filtering and smoothing; the forward–backward algorithm for hidden Markov models; probability propagation in Bayesian networks; and decoding algorithms f...
متن کاملError correcting codes for robust color wavelet watermarking
This article details the conception, design, development and analysis of invisible, blind and robust color image watermarking algorithms based on the wavelet transform. Using error correcting codes, the watermarking algorithms are designed to be robust against intentional or unintentional attacks such as JPEG compression, additive white Gaussian noise, low pass filter and color attacks (hue, sa...
متن کامل